Stress Concentration FEM Simulation of Robot Speed Reducer(RSR) with Straight Line Teeth Profile
نویسندگان
چکیده
منابع مشابه
A Fast Straight Line Extractor for Vision-Guided Robot Navigation
Table 1: average processing times (in seconds). using the internal clock). As expected, the time spent for grouping and segmentation results to be more variable than the time spent for edge detection or acquisition. The former phases strongly depend on the number of local edges that survive the thresholding phase and are therefore image-complexity dependent, while the other depend only on the i...
متن کاملAn off-line robot simulation toolbox
Robotics has gained popularity in education so many engineering schools are offering robotics courses. In this study, a novel robot toolbox, ‘‘ROBOLAB’’ is developed for the educational users to improve the understanding of robotics fundamentals through interactive real-time simulation. To understand manipulator movement in 3-D space with increasing number of joints is very difficult for engine...
متن کاملIndexing Straight-Line Programs∗
Straight-line programs offer powerful text compression by representing a text T [1, u] in terms of a context-free grammar of n rules, so that T can be recovered in O(u) time. However, the problem of operating the grammar in compressed form has not been studied much. We present the first grammar representation able of extracting text substrings, and of searching the text for patterns, in time o(...
متن کاملStraight Line Triangle Representations
A straight line triangle representation (SLTR) of a planar graph is a straight line drawing such that all the faces including the outer face have triangular shape. Such a drawing can be viewed as a tiling of a triangle using triangles with the input graph as skeletal structure. In this paper we present a characterization of graphs that have an SLTR. The charcterization is based on flat angle as...
متن کاملStraight-Line Drawing of Quadrangulations
This article introduces a straight-line drawing algorithm for quadrangulations, in the family of the face-counting algorithms. It outputs in linear time a drawing on a regular W×H grid such that W+H = n − 1 −∆, where n is the number of vertices and ∆ is an explicit combinatorial parameter of the quadrangulation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Korean Institute of Intelligent Systems
سال: 2007
ISSN: 1976-9172
DOI: 10.5391/jkiis.2007.17.7.952